Global Dynamics of Finite Cellular Automata
نویسندگان
چکیده
A novel algebraic and dynamic systems approach to finite elementary cellular automata is presented. In particular, simple algebraic expressions for the local rules of elementary cellular automata are deduced and the cellular automata configurations are represented via Fourier analysis. This allows for a further analysis of the global dynamics of cellular automata by the use of tools derived from functional analysis and dynamical system theory.
منابع مشابه
Improved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملAutomorphisms of Transition Graphs for Elementary Cellular Automata
The transition graph of a cellular automaton (CA) is a graphical representation of the CA’s global dynamics. Studying automorphisms of transition graphs allows us to identify symmetries in this global dynamics. We conduct a computational study of numbers of automorphisms for the elementary cellular automata (ECAs) on finite lattices. The ECAs are partitioned into three classes, depending on how...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملThe Garden of Eden Theorem for Cellular Automata on Group Sets
We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is preinjective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the ...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008